import numpy as np
import random
def binary_search(list, item):
    low = 0
    high = len(list) - 1

    while low <= high:
        mid = (low + high) // 2
        guess = list[mid]
        if guess == item:
            return mid
        elif guess > item:
            high = mid - 1
        else:
            low = mid + 1
    return None

my_list = np.random.randint(0, 200, 30)
my_list.sort()
print(my_list)

item = random.randint(0, 200)
print(item)
position = binary_search(my_list, item)
print(position)